A Tabu Search Technique to Integrate Multicycle Scheduling, Resource Allocation and Binding
نویسندگان
چکیده
This paper describes a technique to integrate the three major tasks of high-level synthesis (scheduling, allocation, and binding) into one optimization step. Furthermore, a fourth task is performed to select the clock period for the design. These tasks are performed to ensure that the local timing constraints used to capture the timing requirements given by the designer in the behavioral specification will be satisfied. The optimization problem is solved with a Tabu search technique. Experimental results show the efficiency of the proposed technique.
منابع مشابه
Multicycle Scheduling under Local Timing Constraints using Genetic Algorithms and Tabu Search
Multicycle scheduling, i.e., the possibility to schedule operations over several clock cycles, gives faster designs. In this paper a method for clock period optimization during multicycle scheduling is described. The proposed method takes into account a set of local timing constraints and selects the appropriate functional units (with different area and delay) that can be used to implement the ...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملFlow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
متن کاملResource allocation using metaheuristic search
This research is focused on solving problems in the area of software project management using metaheuristic search algorithmsand as such is research in the field of search based software engineering. The main aim of this research is to evaluate the performance of different metaheuristic search techniques in resource allocation and scheduling problemsthat would be typical of software development...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997